Self-Organizing Maps for Drawing Large Graphs

نویسندگان

  • Eric Bonabeau
  • Florian Hénaux
چکیده

SFI WORKING PAPER: 1998-07-066 SFI Working Papers contain accounts of scientific work of the author(s) and do not necessarily represent the views of the Santa Fe Institute. We accept papers intended for publication in peer-reviewed journals or proceedings volumes, but not papers that have already appeared in print. Except for papers by our external faculty, papers must be based on work done at SFI, inspired by an invited visit to or collaboration at SFI, or funded by an SFI grant. ©NOTICE: This working paper is included by permission of the contributing author(s) as a means to ensure timely distribution of the scholarly and technical work on a non-commercial basis. Copyright and all rights therein are maintained by the author(s). It is understood that all persons copying this information will adhere to the terms and constraints invoked by each author's copyright. These works may be reposted only with the explicit permission of the copyright holder. www.santafe.edu

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Reconstructing Self Organizing Maps as Spider Graphs for better visual interpretation of large unstructured datasets

-Self-Organizing Maps (SOM) are popular unsupervised artificial neural network used to reduce dimensions and visualize data. Visual interpretation from Self-Organizing Maps (SOM) has been limited due to grid approach of data representation, which makes inter-scenario analysis impossible. The paper proposes a new way to structure SOM. This model reconstructs SOM to show strength between variable...

متن کامل

Gait Based Vertical Ground Reaction Force Analysis for Parkinson’s Disease Diagnosis Using Self Organizing Map

The aim of this work is to use Self Organizing Map (SOM) for clustering of locomotion kinetic characteristics in normal and Parkinson’s disease. The classification and analysis of the kinematic characteristics of human locomotion has been greatly increased by the use of artificial neural networks in recent years. The proposed methodology aims at overcoming the constraints of traditional analysi...

متن کامل

Gait Based Vertical Ground Reaction Force Analysis for Parkinson’s Disease Diagnosis Using Self Organizing Map

The aim of this work is to use Self Organizing Map (SOM) for clustering of locomotion kinetic characteristics in normal and Parkinson’s disease. The classification and analysis of the kinematic characteristics of human locomotion has been greatly increased by the use of artificial neural networks in recent years. The proposed methodology aims at overcoming the constraints of traditional analysi...

متن کامل

Gait Based Vertical Ground Reaction Force Analysis for Parkinson’s Disease Diagnosis Using Self Organizing Map

The aim of this work is to use Self Organizing Map (SOM) for clustering of locomotion kinetic characteristics in normal and Parkinson’s disease. The classification and analysis of the kinematic characteristics of human locomotion has been greatly increased by the use of artificial neural networks in recent years. The proposed methodology aims at overcoming the constraints of traditional analysi...

متن کامل

Gait Based Vertical Ground Reaction Force Analysis for Parkinson’s Disease Diagnosis Using Self Organizing Map

The aim of this work is to use Self Organizing Map (SOM) for clustering of locomotion kinetic characteristics in normal and Parkinson’s disease. The classification and analysis of the kinematic characteristics of human locomotion has been greatly increased by the use of artificial neural networks in recent years. The proposed methodology aims at overcoming the constraints of traditional analysi...

متن کامل

Study of Neural Network Algorithm for Straight-Line Drawings of Planar Graphs

Graph drawing addresses the problem of finding a layout of a graph that satisfies given aesthetic and understandability objectives. The most important objective in graph drawing is minimization of the number of crossings in the drawing, as the aesthetics and readability of graph drawings depend on the number of edge crossings. VLSI layouts with fewer crossings are more easily realizable and con...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Inf. Process. Lett.

دوره 67  شماره 

صفحات  -

تاریخ انتشار 1998